On kaleidoscopic pseudo-randomness of finite Euclidean graphs

نویسنده

  • Le Anh Vinh
چکیده

In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixing in High-Dimensional Expanders

We establish a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to as mixing, or pseudorandomness). Recently, an analogue of this Lemma was proved for simplicial complexes of arbitrary dimension, provided that the skeleto...

متن کامل

Lagrangian Mean Curvature Flow in Pseudo-euclidean Space

We establish the longtime existence and convergence results of the mean curvature flow of entire Lagrangian graphs in pseudo-Euclidean space.

متن کامل

Explicit Ramsey Graphs and Erdös Distance Problems over Finite Euclidean and Non-Euclidean Spaces

We study the Erdős distance problem over finite Euclidean and non-Euclidean spaces. Our main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are considered in Bannai-Shimabukuro-Tanaka (2004, 2007). These graphs are shown to be asymptotically Ramanujan graphs. The advantage of using these graphs is twofold. First, we can derive new lower bounds on the Erdős distanc...

متن کامل

Finite Euclidean graphs over ℤ2r are non-Ramanujan

Graphs are attached to 2r where 2r is the ring with 2 r elements using an analogue of Euclidean distance. M.R. DeDeo (2003) showed that these graphs are non-Ramanujan for r 4. In this paper, we will show that finite Euclidean graphs attached to 2r are non Ramanujan for r 2 except for r = 2 and d = 2, 3. Together with the results in Medrano et al. (1998), this implies that finite Euclidean graph...

متن کامل

Constructing Kaleidoscopic Tiling Polygons in the Hyperbolic Plane

We have all seen many of the beautiful patterns obtained by tiling the hyperbolic plane H by repeated reflection in the sides of a "kaleidoscopic" polygon. Though there are such patterns on the sphere and the euclidean plane, these positively curved and fiat geometries lack the richness we see in the hyperbolic plane. Many of these patterns have been popularized by the beautiful art of M.C. Esc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discussiones Mathematicae Graph Theory

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2012